A secure voting system on a public network

We point out that the encryption process of [1, 2] is not invertible. This becomes evident through the following, illustrative, example. In accordance with Chang and Wu’s [1] protocol, let us assume that there are n eligible voters U1, . . . , Un, participating in the election. Further assume that the Voting Center chooses a prime number P, for example P 31, and a primitive element e 7 over GF(31), and publicizes them. Based on the above assumptions we describe the voting phase. The purpose of this phase is to support the casting of votes and the secure encryption and decryption of ballots. Assume that the Voting Center’s {private, public} key pair is ( x0, y0) (5, 5). Let the Voter’s voting strategy be Vi 6. In accordance with the Chang and Wu protocol, the following steps have to be performed: